The Geometry of the Weak Lefschetz Property and Level Sets of Points

نویسنده

  • JUAN C. MIGLIORE
چکیده

In a recent paper, F. Zanello showed that level Artinian algebras in 3 variables can fail to have the Weak Lefschetz Property (WLP), and can even fail to have unimodal Hilbert function. We show that the same is true for the Artinian reduction of reduced, level sets of points in projective 3-space. Our main goal is to begin an understanding of how the geometry of a set of points can prevent its Artinian reduction from having WLP, which in itself is a very algebraic notion. More precisely, we produce level sets of points whose Artinian reductions have socle types 3 and 4 and arbitrary socle degree ≥ 12 (in the worst case), but fail to have WLP. We also produce a level set of points whose Artinian reduction fails to have unimodal Hilbert function; our example is based on Zanello’s example. Finally, we show that a level set of points can have Artinian reduction that has WLP but fails to have the Strong Lefschetz Property. While our constructions are all based on basic double G-linkage, the implementations use very different methods.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Weak Lefschetz Property, Inverse Systems and Fat Points

In [13], Migliore–Miró-Roig–Nagel show that the Weak Lefschetz property can fail for an ideal I ⊆ K[x1, . . . , x4] generated by powers of linear forms. This is in contrast to the analogous situation in K[x1, x2, x3], where WLP always holds [16]. We use the inverse system dictionary to connect I to an ideal of fat points, and show that failure of WLP for powers of linear forms is connected to t...

متن کامل

Inverse systems, Gelfand-Tsetlin patterns and the weak Lefschetz property

In [19], Migliore–Miró-Roig–Nagel show that the Weak Lefschetz property can fail for an ideal I ⊆ K[x 1 ,. .. , x 4 ] generated by powers of linear forms. This is in contrast to the analogous situation in K[x 1 , x 2 , x 3 ], where WLP always holds [24]. We use the inverse system dictionary to connect I to an ideal of fat points, and show that failure of WLP for powers of linear forms is connec...

متن کامل

A convex combinatorial property of compact sets in the plane and its roots in lattice theory

K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...

متن کامل

?-Independent and Dissociate Sets on Compact Commutative Strong Hypergroups

In this paper we define ?-independent (a weak-version of independence), Kronecker and dissociate sets on hypergroups and study their properties and relationships among them and some other thin sets such as independent and Sidon sets. These sets have the lacunarity or thinness property and are very useful indeed. For example Varopoulos used the Kronecker sets to prove the Malliavin theorem. In t...

متن کامل

Sweep Line Algorithm for Convex Hull Revisited

Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005